A Localization Algorithm for D-modules

نویسندگان

  • Toshinori Oaku
  • Nobuki Takayama
  • Uli Walther
چکیده

We present a method to compute the holonomic extension of a D-module from a Zariski open set in affine space to the whole space. A particular application is the localization of coherent D-modules which are holonomic on the complement of an affine variety. Throughout this article let R = K[x1, . . . , xn] be the ring of polynomials in n variables over the field K of characteristic zero and D = R〈∂1, . . . , ∂n〉 the n-th Weyl algebra over K. Here, ∂i = ∂ ∂xi . Suppose f ∈ R, let J be a left ideal of D and set M = D/J . Let X = Kn, Y = V(f) ⊆ X, U = X \ Y and j : U →֒ X the natural inclusion. In the landmark paper [K2] M. Kashiwara proved that ∫ j j −1M is holonomic provided that M is holonomic on U , but not necessarily on all of X. In this note we make this important result algorithmic in the sense that we provide an algorithm that computes the module structure of ∫ j j −1M over D. We remark that U is affine and X = Kn, and so ∫ j j −1M = Rf ⊗R M as D-module. An algorithm to compute Rf⊗RM as aD-module has been given in [Oa3] under the assumption that M is holonomic on Kn and f -torsion free, and in [O-T2] under the assumption that M is holonomic on Kn. The advantage of our new algorithm, besides removing the requirement of holonomicity on V(f), is that the natural map M → Rf⊗RM can be traced, which is an important property for other computations as local cohomology ([Oa3], [W1]) and de Rham cohomology ([O-T1], [W2]). 1. Description of the Algorithm We shall start with a motivating construction which will also provide a skeleton of the proof of the correctness of our algorithm. Assume that K is in fact the field C of complex numbers. Let s, v be two new variables and let Dv = D〈v, ∂v〉. Notation 1. Throughout we will denote ∂f/∂xi by fi. If P ∈ Dv is an operator interpreted as a polynomial in ∂1, . . . , ∂n, we will simply write P (∂x). Similarly we will abbreviate P (∂1 − v f1∂v, . . . , ∂n − v fn∂v) by P (∂x − v fx∂v). Consider the ringDv and the C-vectorspace Rf [s]⊗f −s. Here, f−s should be thought of as a symbol that behaves like the complex valued function f−s Date: November 4, 1998. 1 2 TOSHINORI OAKU, NOBUKI TAKAYAMA AND ULI WALTHER under differentiation and the tensor is over C. We shall turn this vectorspace into a module over Dv by means of the action • defined as follows. We require that all xi act as multiplication on the left factor, while ∂i acts by the “product rule” ∂i • ( g(x,s) fm ⊗ f −s) = ∂i( g(x,s) fm )⊗ f −s+ g(x,s) fm+1 (−s)fi⊗ f −s. Thus, we only need to define the action of v and ∂v. We set

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Rssi Based Localization Algorithm for WSN Using a Mobile Anchor Node

Wireless sensor networks attracting a great deal of research interest. Accurate localization of sensor nodes is a strong requirement in a wide area of applications. In recent years, several techniques have been proposed for localization in wireless sensor networks. In this paper we present a localization scheme with using only one mobile anchor station and received signal strength indicator tec...

متن کامل

Kohonen Self Organizing for Automatic Identification of Cartographic Objects

Automatic identification and localization of cartographic objects in aerial and satellite images have gained increasing attention in recent years in digital photogrammetry and remote sensing. Although the automatic extraction of man made objects in essence is still an unresolved issue, the man made objects can be extracted from aerial photos and satellite images. Recently, the high-resolution s...

متن کامل

Optimal Localization of Shopping Centers Using Metaheuristic Genetic Algorithm

Efficiency and effectiveness is of importance for selection and localization. There should be regular methodology for targeting in the market by several methods. There is a necessity to have clear study for selection. In the current research, it has been studied the optimal localization at shopping centers. If there is not accuracy and validity, there will be achieved negative results for these...

متن کامل

A multi-hop PSO based localization algorithm for wireless sensor networks

A sensor network consists of a large number of sensor nodes that are distributed in a large geographic environment to collect data. Localization is one of the key issues in wireless sensor network researches because it is important to determine the location of an event. On the other side, finding the location of a wireless sensor node by the Global Positioning System (GPS) is not appropriate du...

متن کامل

On the Associated Primes of the generalized $d$-Local Cohomology Modules

The first part of the paper is concerned to relationship between the sets of associated primes of the generalized $d$-local cohomology modules and the ordinary  generalized local cohomology  modules.  Assume that $R$ is a commutative Noetherian local ring, $M$ and $N$  are  finitely generated  $R$-modules and $d, t$ are two integers. We prove that $Ass H^t_d(M,N)=bigcup_{Iin Phi} Ass H^t_I(M,N)...

متن کامل

Map-merging in Multi-robot Simultaneous Localization and Mapping Process Using Two Heterogeneous Ground Robots

In this article, a fast and reliable map-merging algorithm is proposed to produce a global two dimensional map of an indoor environment in a multi-robot simultaneous localization and mapping (SLAM) process. In SLAM process, to find its way in this environment, a robot should be able to determine its position relative to a map formed from its observations. To solve this complex problem, simultan...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Symb. Comput.

دوره 29  شماره 

صفحات  -

تاریخ انتشار 2000